Enhancing Contention Resolution ALOHA Using Combining Techniques
نویسندگان
چکیده
منابع مشابه
Enhancing Contention Resolution ALOHA using Combining Techniques
Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine. Asynchronous (slotand frame-wise) ALOHA-like random access protocols, are very attractive for such applications, enabling low complexity transmitters and avoiding time synchronizati...
متن کاملEnhanced Contention Resolution Aloha - ECRA
Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is presented. This evolution, based on the previous Contention Resolution ALOHA (CRA) protocol, exploits the nature of the interference in unslotted Aloha-like channels...
متن کاملExploiting Combination Techniques in Random Access MAC Protocols: Enhanced Contention Resolution ALOHA
Recently, random access (RA) protocols have acquired new interest from the scientific community not only in satellite communication scenarios but also due to the opening of new fields as smart grid and machine-to-machine (M2M) applications. Unslotted ALOHA-like RA protocols are very attractive for such applications thanks to the low complexity transmitters and to their complete avoidance of syn...
متن کاملFIFO by Sets ALOHA (FS-ALOHA): A Collision Resolution Algorithm for the Contention Channel in Wireless ATM Systems
This paper presents a Collision Resolution Algorithm which significantly improves the performance in terms of throughput and delay of the uplink contention channel existing in Wireless ATM MAC protocols such as MASCARA [9], where slotted ALOHA is employed. FS-ALOHA groups the requests arrived at the mobile terminals during a frame length and serves these groups on a FIFO basis using slotted ALO...
متن کاملOnline Contention Resolution Schemes
We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call online contention resolution schemes (OCRSs), is applicable to many online selection problems, including Bayesian online selection, oblivious ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778
DOI: 10.1109/tcomm.2017.2759264